cond1(true, x, y) → cond2(gr(x, 0), x, y)
cond2(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), p(x), y)
cond2(false, x, y) → cond3(gr(y, 0), x, y)
cond3(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, p(y))
cond3(false, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, y)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
or(false, false) → false
or(true, x) → true
or(x, true) → true
p(0) → 0
p(s(x)) → x
↳ QTRS
↳ DependencyPairsProof
cond1(true, x, y) → cond2(gr(x, 0), x, y)
cond2(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), p(x), y)
cond2(false, x, y) → cond3(gr(y, 0), x, y)
cond3(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, p(y))
cond3(false, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, y)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
or(false, false) → false
or(true, x) → true
or(x, true) → true
p(0) → 0
p(s(x)) → x
COND3(true, x, y) → GR(x, 0)
COND2(true, x, y) → OR(gr(x, 0), gr(y, 0))
COND3(false, x, y) → OR(gr(x, 0), gr(y, 0))
COND2(true, x, y) → P(x)
COND1(true, x, y) → COND2(gr(x, 0), x, y)
COND1(true, x, y) → GR(x, 0)
COND3(true, x, y) → OR(gr(x, 0), gr(y, 0))
COND3(false, x, y) → GR(x, 0)
COND3(true, x, y) → P(y)
COND2(true, x, y) → GR(x, 0)
COND3(true, x, y) → GR(y, 0)
COND2(false, x, y) → GR(y, 0)
COND2(true, x, y) → COND1(or(gr(x, 0), gr(y, 0)), p(x), y)
COND3(true, x, y) → COND1(or(gr(x, 0), gr(y, 0)), x, p(y))
COND3(false, x, y) → COND1(or(gr(x, 0), gr(y, 0)), x, y)
COND3(false, x, y) → GR(y, 0)
COND2(true, x, y) → GR(y, 0)
GR(s(x), s(y)) → GR(x, y)
COND2(false, x, y) → COND3(gr(y, 0), x, y)
cond1(true, x, y) → cond2(gr(x, 0), x, y)
cond2(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), p(x), y)
cond2(false, x, y) → cond3(gr(y, 0), x, y)
cond3(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, p(y))
cond3(false, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, y)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
or(false, false) → false
or(true, x) → true
or(x, true) → true
p(0) → 0
p(s(x)) → x
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
COND3(true, x, y) → GR(x, 0)
COND2(true, x, y) → OR(gr(x, 0), gr(y, 0))
COND3(false, x, y) → OR(gr(x, 0), gr(y, 0))
COND2(true, x, y) → P(x)
COND1(true, x, y) → COND2(gr(x, 0), x, y)
COND1(true, x, y) → GR(x, 0)
COND3(true, x, y) → OR(gr(x, 0), gr(y, 0))
COND3(false, x, y) → GR(x, 0)
COND3(true, x, y) → P(y)
COND2(true, x, y) → GR(x, 0)
COND3(true, x, y) → GR(y, 0)
COND2(false, x, y) → GR(y, 0)
COND2(true, x, y) → COND1(or(gr(x, 0), gr(y, 0)), p(x), y)
COND3(true, x, y) → COND1(or(gr(x, 0), gr(y, 0)), x, p(y))
COND3(false, x, y) → COND1(or(gr(x, 0), gr(y, 0)), x, y)
COND3(false, x, y) → GR(y, 0)
COND2(true, x, y) → GR(y, 0)
GR(s(x), s(y)) → GR(x, y)
COND2(false, x, y) → COND3(gr(y, 0), x, y)
cond1(true, x, y) → cond2(gr(x, 0), x, y)
cond2(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), p(x), y)
cond2(false, x, y) → cond3(gr(y, 0), x, y)
cond3(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, p(y))
cond3(false, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, y)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
or(false, false) → false
or(true, x) → true
or(x, true) → true
p(0) → 0
p(s(x)) → x
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
GR(s(x), s(y)) → GR(x, y)
cond1(true, x, y) → cond2(gr(x, 0), x, y)
cond2(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), p(x), y)
cond2(false, x, y) → cond3(gr(y, 0), x, y)
cond3(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, p(y))
cond3(false, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, y)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
or(false, false) → false
or(true, x) → true
or(x, true) → true
p(0) → 0
p(s(x)) → x
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
GR(s(x), s(y)) → GR(x, y)
The value of delta used in the strict ordering is 1.
POL(GR(x1, x2)) = x_2
POL(s(x1)) = 1 + x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
cond1(true, x, y) → cond2(gr(x, 0), x, y)
cond2(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), p(x), y)
cond2(false, x, y) → cond3(gr(y, 0), x, y)
cond3(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, p(y))
cond3(false, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, y)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
or(false, false) → false
or(true, x) → true
or(x, true) → true
p(0) → 0
p(s(x)) → x
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
COND2(true, x, y) → COND1(or(gr(x, 0), gr(y, 0)), p(x), y)
COND3(true, x, y) → COND1(or(gr(x, 0), gr(y, 0)), x, p(y))
COND1(true, x, y) → COND2(gr(x, 0), x, y)
COND3(false, x, y) → COND1(or(gr(x, 0), gr(y, 0)), x, y)
COND2(false, x, y) → COND3(gr(y, 0), x, y)
cond1(true, x, y) → cond2(gr(x, 0), x, y)
cond2(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), p(x), y)
cond2(false, x, y) → cond3(gr(y, 0), x, y)
cond3(true, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, p(y))
cond3(false, x, y) → cond1(or(gr(x, 0), gr(y, 0)), x, y)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
or(false, false) → false
or(true, x) → true
or(x, true) → true
p(0) → 0
p(s(x)) → x